Higher-Order Tableaux
نویسنده
چکیده
Even though higher-order calculi for automated theorem proving are rather old, tableau calculi have not been investigated yet. This paper presents two free variable tableau calculi for higher-order logic that use higher-order uniication as the key inference procedure. These calculi diier in the treatment of the substitutional properties of equivalences. The rst calculus is equivalent in deductive power to the machine-oriented higher-order refutation calculi known from the literature, whereas the second is complete with respect to Henkin's general models.
منابع مشابه
Reasoning with Higher Order Partial Functions
In this paper we introduce the logic P HOL, which embodies higher-order functions through a simply-typed-calculus and deals with partial objects by using partially ordered domains and three truth values. We deene a refutationally complete tableaux method for P HOL and we show how to derive a sound and complete cut free sequent calculus through a systematic analysis of the rules for tableaux con...
متن کاملHOT: A Concurrent Automated Theorem Prover Based on Higher-Order Tableaux
Hot is an automated higher-order theorem prover based on HT E, an extensional higher-order tableaux calculus. The rst part of this paper introduces an improved variant of the calculus which closely corresponds to the proof procedure implemented in Hot. The second part discusses Hot's design that can be characterized as a concurrent blackboard architecture. We show the usefulness of the implemen...
متن کاملCombining Theories Sharing Dense Orders
The Nelson-Oppen combination method combines decision procedures for first-order theories satisfying certain conditions into a single decision procedure for the union theory. The Nelson-Oppen combination method can be applied only if the signatures of the combined theories are disjoint. Combination tableaux (C-tableaux) are an extension of Smullyan tableaux for combining first-order theories wh...
متن کاملHigher - Order Automated Theorem Proving for NaturalLanguage
This paper describes a tableau-based higher-order theorem prover Hot and an application to natural language semantics. In this application, Hot is used to prove equivalences using world knowledge during higher-order uniication (HOU). This extended form of HOU is used to compute the licensing conditions for corrections.
متن کامل